Network flow problem

Results: 219



#Item
51Noname manuscript No. (will be inserted by the editor) Network Construction with Subgraph Connectivity Constraints Dana Angluin · James Aspnes · Lev

Noname manuscript No. (will be inserted by the editor) Network Construction with Subgraph Connectivity Constraints Dana Angluin · James Aspnes · Lev

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2015-04-30 10:34:00
52Testable Implications of Linear Structural Equation Models

Testable Implications of Linear Structural Equation Models

Add to Reading List

Source URL: ftp.cs.ucla.edu

Language: English - Date: 2014-05-09 18:54:50
53Algorithms  Lecture 24: Applications of Maximum Flow [Fa’13] For a long time it puzzled me how something so expensive, so leading edge, could be so useless, and then it occurred to me that a computer is a stupid

Algorithms Lecture 24: Applications of Maximum Flow [Fa’13] For a long time it puzzled me how something so expensive, so leading edge, could be so useless, and then it occurred to me that a computer is a stupid

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:09
54The Quorum Deployment Problem (Extended Abstract) Seth Gilbert1 and Grzegorz Malewicz2 1  Massachusetts Institute of Technology

The Quorum Deployment Problem (Extended Abstract) Seth Gilbert1 and Grzegorz Malewicz2 1 Massachusetts Institute of Technology

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2007-09-28 06:21:18
55CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014  A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗  Michael Hemmer∗

CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A PTAS for the continuous 1.5D Terrain Guarding Problem Stephan Friedrichs∗ Michael Hemmer∗

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2014-07-28 18:32:50
56Finding Shortest Non-Trivial Cycles ∗ in Directed Graphs on Surfaces Sergio Cabello  Éric Colin de Verdière

Finding Shortest Non-Trivial Cycles ∗ in Directed Graphs on Surfaces Sergio Cabello Éric Colin de Verdière

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2010-04-01 04:31:48
57A Soft Constraint-based Approach to the Cascade Vulnerability Problem Stefano Bistarelli Istituto di Informatica e Telematica, CNR, Pisa, Italy

A Soft Constraint-based Approach to the Cascade Vulnerability Problem Stefano Bistarelli Istituto di Informatica e Telematica, CNR, Pisa, Italy

Add to Reading List

Source URL: www.cs.ucc.ie

Language: English - Date: 2006-08-23 05:01:39
58Speeding up Algorithms on Compressed Web Graphs Chinmay Karande Kumar Chellapilla

Speeding up Algorithms on Compressed Web Graphs Chinmay Karande Kumar Chellapilla

Add to Reading List

Source URL: www.wsdm2009.org

Language: English - Date: 2009-04-14 09:42:28
59Capacity of Multi-Channel Wireless Networks ∗ with Random (c, f) Assignment Vartika Bhandari  Nitin H. Vaidya

Capacity of Multi-Channel Wireless Networks ∗ with Random (c, f) Assignment Vartika Bhandari Nitin H. Vaidya

Add to Reading List

Source URL: www.sigmobile.org

Language: English - Date: 2013-08-14 12:38:30
60Formworks Pairing Optimization 1  Towards Optimal Formwork Pairing on Construction Sites Thierry Benoist Bouygues e-lab,

Formworks Pairing Optimization 1 Towards Optimal Formwork Pairing on Construction Sites Thierry Benoist Bouygues e-lab,

Add to Reading List

Source URL: tbenoist.pagesperso-orange.fr

Language: English - Date: 2008-07-09 00:55:53